Modular Focused Proof Systems for Intuitionistic Modal Logics

نویسندگان

  • Kaustuv Chaudhuri
  • Sonia Marin
  • Lutz Straßburger
چکیده

Focusing is a general technique for syntactically compartmentalizing the non-deterministic choices in a proof system, which not only improves proof search but also has the representational benefit of distilling sequent proofs into synthetic normal forms. However, since focusing is usually specified as a restriction of the sequent calculus, the technique has not been transferred to logics that lack a (shallow) sequent presentation, as is the case for some of the logics of the modal cube. We have recently extended the focusing technique to classical nested sequents, a generalization of ordinary sequents. In this work we further extend focusing to intuitionistic nested sequents, which can capture all the logics of the intuitionistic S5 cube in a modular fashion. We present an internal cut-elimination procedure for the focused system which in turn is used to show its completeness. 1998 ACM Subject Classification F.4.2 [Mathematical logic] Proof theory

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Contribution of A.v. Kuznetsov to the Theory of Modal Systems and Structures

We will outline the contributions of A.V. Kuznetsov to modal logic. In his research he focused mainly on semantic, i.e. algebraic, issues and lattices of extensions of particular modal logics, though his proof of the Full Conservativeness Theorem for the proof-intuitionistic logic KM (Theorem 17 below) is a gem of proof-theoretic art.

متن کامل

Realization Theorems for Justification Logics: Full Modularity

Justification logics were introduced by Artemov in 1995 to provide intuitionistic logic with a classical provability semantics, a problem originally posed by Gödel. Justification logics are refinements of modal logics and formally connected to them by so-called realization theorems. A constructive proof of a realization theorem typically relies on a cut-free sequent-style proof system for the c...

متن کامل

The Focused Constraint Inverse Method for Intuitionistic Modal Logics

We present a focused inverse method for proof search in a variety of intuitionistic modal logics such as K, D, T, S4 and S5. Unification of worldpaths for such logics is non-unitary and therefore handled by adding constraints to sequents. We sketch proofs of soundness and completeness with respect to intuitionistic modal natural deduction and describe our implementation. Potential applications ...

متن کامل

The proof theory and semantics of intuitionistic modal logic

Possible world semantics underlies many of the applications of modal logic in computer science and philosophy. The standard theory arises from interpreting the semantic definitions in the ordinary meta-theory of informal classical mathematics. If, however, the same semantic definitions are interpreted in an intuitionistic metatheory then the induced modal logics no longer satisfy certain intuit...

متن کامل

Some Proof Theoretic Considerations in Intuitionistic Propositional Modal Logic

Formalizations of different logics can serve as foundations for reasoning about various properties of both hardware and software systems. Intuitionistic modal logics, featuring operators encoding possibility and necessity, have recently found applications in hardware verification as well as proposed type systems for staged computation and distributed computing. We propose several novel sequent ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016